<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    242. Valid Anagram
   </h1>
   <p>
    Given two strings
    <em>
     s
    </em>
    and
    <em>
     t&nbsp;
    </em>
    , write a function to determine if
    <em>
     t
    </em>
    is an anagram of
    <em>
     s
    </em>
    .
   </p>
   <p>
    <b>
     Example 1:
    </b>
   </p>
   <pre>
<b>Input:</b> <em>s</em> = "anagram", <em>t</em> = "nagaram"
<b>Output:</b> true
</pre>
   <p>
    <b>
     Example 2:
    </b>
   </p>
   <pre>
<b>Input:</b> <em>s</em> = "rat", <em>t</em> = "car"
<b>Output: </b>false
</pre>
   <p>
    <strong>
     Note:
    </strong>
    <br>
    You may assume the string contains only lowercase alphabets.
   </p>
   <p>
    <strong>
     Follow up:
    </strong>
    <br>
    What if the inputs contain unicode characters? How would you adapt your solution to such case?
   </p>
  </div>
  <div>
   <h1 class="question_title">
    242. 有效的字母异位词
   </h1>
   <p>
    给定两个字符串
    <em>
     s
    </em>
    和
    <em>
     t
    </em>
    ，编写一个函数来判断
    <em>
     t
    </em>
    是否是
    <em>
     s
    </em>
    的一个字母异位词。
   </p>
   <p>
    <strong>
     示例&nbsp;1:
    </strong>
   </p>
   <pre><strong>输入:</strong> <em>s</em> = "anagram", <em>t</em> = "nagaram"
<strong>输出:</strong> true
</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre><strong>输入:</strong> <em>s</em> = "rat", <em>t</em> = "car"
<strong>输出: </strong>false</pre>
   <p>
    <strong>
     说明:
    </strong>
    <br>
    你可以假设字符串只包含小写字母。
   </p>
   <p>
    <strong>
     进阶:
    </strong>
    <br>
    如果输入字符串包含 unicode 字符怎么办？你能否调整你的解法来应对这种情况？
   </p>
  </div>
 </body>
</html>